PDMM: A Novel Primal-Dual Majorization-Minimization Algorithm for Poisson Phase-Retrieval Problem

نویسندگان

چکیده

In this paper, we introduce a novel iterative algorithm for the problem of phase-retrieval where measurements consist only magnitude linear function unknown signal, and noise in follow Poisson distribution. The proposed is based on principle majorization-minimization (MM); however, application MM here very distinct from way has been usually used to solve optimization problems literature. More precisely, reformulate original minimization into saddle point by invoking Fenchel dual representation log (.) term likelihood function. We then propose tighter surrogate functions over both primal variables resulting double-loop algorithm, which have named as Primal-Dual Majorization-Minimization (PDMM) algorithm. steps are simple implement involve computing matrix vector products. also extend our handle various L1 regularized (which exploit sparsity). compared with previously algorithms such wirtinger flow (WF), (conventional), alternating direction methods multipliers (ADMM) data model. simulation results under different experimental settings show that PDMM faster than competing methods, its performance recovering signal at par state-of-the-art algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Undersampled Phase Retrieval via Majorization-Minimization

In the undersampled phase retrieval problem, the goal is to recover an N -dimensional complex signal x from only M < N noisy intensity measurements without phase information. This problem has drawn a lot of attention to reduce the number of required measurements since a recent theory established that M ≈ 4N intensity measurements are necessary and sufficient to recover a generic signal x. In th...

متن کامل

Study of a primal-dual algorithm for equality constrained minimization

The paper proposes a primal-dual algorithm for solving an equality constrained minimization problem. The algorithm is a Newton-like method applied to a sequence of perturbed optimality systems that follow naturally from the quadratic penalty approach. This work is first motivated by the fact that a primaldual formulation of the quadratic penalty provides a better framework than the standard pri...

متن کامل

A Primal Dual Algorithm for a Heterogeneous Traveling Salesman Problem

Surveillance applications require a collection of heterogeneous vehicles to visit a set of targets. We consider a fundamental routing problem that arises in these applications involving two vehicles. Specifically, we consider a routing problem where there are two heterogeneous vehicles that start from distinct initial locations, and a set of targets. The objective is to find a tour for each veh...

متن کامل

A Primal-Dual Approximation Algorithm for the Steiner Forest Problem

Given an undirected graph with nonnegative edge-costs, a subset of nodes of size k called the terminals, and an integer q between 1 and k, the minimum q-Steiner forest problem is to find a forest of minimum cost with at most q trees that spans all the terminals. When q = 1, we have the classical minimum-cost Steiner tree problem on networks. We adapt a primal-dual approximation algorithm for th...

متن کامل

A Primal-Dual Approximation Algorithm for the Steiner Connectivity Problem

We extend the primal-dual approximation technique of Goemans and Williamson to the Steiner connectivity problem, a kind of Steiner tree problem in hypergraphs. This yields a (k+1)-approximation algorithm for the case that k is the minimum of the maximal number of nodes in a hyperedge minus 1 and the maximal number of terminal nodes in a hyperedge. These results require the proof of a degree pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2022

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2022.3156014